Constructing fullerene graphs from their eigenvalues and angles
نویسندگان
چکیده
منابع مشابه
Constructing fullerene graphs from their eigenvalues and angles
We discuss means of constructing fullerene graphs from their eigenvalues and angles. An algorithm for such a construction is given. © 2002 Elsevier Science Inc. All rights reserved.
متن کاملAn algorithm for constructing graphs with given eigenvalues and angles
Let the eigenvalues of a graph and the angles between eigenspaces and the co-ordinate axes of the corresponding real vector space be given for a graph. Cvetković [2] gave a method of constructing a graph which is the supergraph of all graphs with given eigenvalues and angles. Based on this, we describe a branch & bound algorithm for constructing all graphs with given eigenvalues and angles.
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملEigenvalues of directed and undirected graphs and their applications
In this thesis, we studied eigenvalues of directed and undirected graphs and their applications. In the first part, a detailed study of the largest eigenvalue of the normalized Laplace operator ∆ for undirected graphs was presented. In contrast to the smallest nontrivial eigenvalue λ1, the largest eigenvalue λn−1 has not been studied systematically before. However, it is well-known that λ1 can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2002
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(02)00280-x